A Grammar Formalism and Cross-Serial Dependencies
نویسنده
چکیده
First we deene a uniication grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this grammar formalism deenes a full abstract family of languages, and that it is capable of describing cross-serial dependencies of the type found in Swiss German.
منابع مشابه
Stochastic Definite Clause Grammars
This paper introduces Stochastic Definite Clause Grammars, a stochastic variant of the wellknown Definite Clause Grammars. The grammar formalism supports parameter learning from annotated or unannotated corpora and provides a mechanism for parse selection by means of statistical inference. Unlike probabilistic contextfree grammars, it is a context-sensitive grammar formalism and it has the abil...
متن کاملStatistical Parsing with an Automatically-Extracted Tree Adjoining Grammar
Why use tree adjoining grammars (TAG) for statistical parsing? It might be thought that its added formal power makes parameter estimation unnecessarily difficult; or that whatever benefits it provides—the ability to model unbounded cross-serial dependencies, for example— are inconsequential for statistical parsing, which is concerned with the probable rather than the possible. But just as TAG i...
متن کاملPolynomial Pregroup Grammars parse Context Sensitive Languages
Pregroup grammars with a possibly infinite number of lexical entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensitive natural language fragments of Dutch, SwissGerman or Old Georgian. A polynomial recogn...
متن کاملDutch Cross Serial Dependencies in HPSG
We present an analysis of Dutch cross serial dependencies in Head-driven Phrase Structure Grammar ((P&S(1994)]). We start out from the assumption that causative and perceptual verbs, like auxiliaries, can lexically`raise' the arguments of the non-nite verbs they govern to their own list of arguments through \argument composition" ((H&N(1989)]).
متن کاملExtended Cross-Serial Dependencies in Tree Adjoining Grammars
The ability to represent cross-serial dependencies is one of the central features of Tree Adjoining Grammar (TAG). The class of dependency structures representable by lexicalized TAG derivations can be captured by two graph-theoretic properties: a bound on the gap degree of the structures, and a constraint called well-nestedness. In this paper, we compare formalisms from two strands of extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cmp-lg/9507012 شماره
صفحات -
تاریخ انتشار 1995